Specifying and Verifying Web Transactions
نویسندگان
چکیده
New evolving internet technologies are extending the role of the World Wide Web from a platform of information exhibition to a new environment for service interactions. While new business opportunities are brought in under this new era of internet, novel challenges are coming out at the same time. Current technologies have been found lacking efficient support for web transactions. Because transactions in the context of web services have distinct features, such as autonomous and interactive, the traditional automatic mechanisms of resource locking and rollback are proved to be inappropriate. For this reason, we suggest that web transactions are constructed through a series of compensable transactions, using the concept of compensation to ensure a relatively relaxed atomicity. This paper formally expresses the composition structures and behavioral dependencies of compensable transactions. Based on the formal description for a transaction model, we are able to further verify its transactional behavior according to the specified requirement of relaxed atomicity and more precise behavioral properties with temporal constraints.
منابع مشابه
Specifying and Verifying Compliance in Commitment Protocols by Mahadevan Venkatraman a Thesis Submitted to the Graduate Faculty of North Carolina State University in Partial Fulfillment of the Requirements for the Degree of Master of Science Department of Computer Science Raleigh
VENKATRAMAN, MAHADEVAN. Specifying and Verifying Compliance in Commitment Protocols (Under the direction of Dr. Munindar P. Singh). Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open systems, such as those that arise in most interesting web applications. A variety of com...
متن کاملA B2B message-exchange pattern based formal approach for Semantic Web services
Current Business-to-Business interactions rely on complex exchange of messages. Web Services technologies provide a basis to establish the Web as the ubiquitous technical platform for B2B applications. However, there is a need of formalism for specifying behaviour and verifying certain properties such as well-formedness or deadlock freedom. In this paper, we present a message-exchange pattern b...
متن کاملSpecifying Strict Serializability of Iterated Transactions in Propositional Temporal Logic
We present an operator for a propositional linear temporal logic over infinite schedules of iterated transactions, which, when applied to a formula, asserts that any schedule satisfying the formula is serializable. The resulting logic is suitable for specifying and verifying consistency properties of concurrent transaction management systems, that can be defined in terms of serializability, as ...
متن کاملSpecification and Verification of Views over Composite Web Services Using High Level Petri-Nets
This paper presents a high level Petri-Net approach for specifying and verifying views over composite Web service. High level Petri-Nets have the capacity of formally modeling and verifying complex systems. A view is mainly used for tracking purposes as it permits representing a contextual snapshot of a composite Web service specification. The use of the proposed high level Petri-Net approach i...
متن کاملTowards Formal Verification of Web Service Composition
Correct notation for specifying the composite service alone is not sufficient to guarantee reliability, thus comes a strong demand on modeling and verifying web services composition languages. This paper presented a formal method of web service composition verification based on Petri net. Focus is given on BPEL4WS specification, of which both behavior semantics and communication semantics are c...
متن کامل